Computational complexity - PDFSEARCH.IO - Document Search Engine

Computational complexity
Results: 2253

#	Item
841	Computational Complexity Foundation Inc. Bylaws July 31, 2014 Table of Contents Add to Reading List Source URL: computationalcomplexity.org Language: English - Date: 2014-07-31 18:49:50 Political communication Politics Structure Heights Community Council Social psychology American Society of Ichthyologists and Herpetologists Committees Human communication Meetings
842	C HICAGO J OURNAL OF T HEORETICAL C OMPUTER S CIENCE 2012, Article 07, pages 1–24 http://cjtcs.cs.uchicago.edu/ Computational Models with No Linear Speedup Amir M. Ben-Amram Add to Reading List Source URL: cjtcs.cs.uchicago.edu Language: English - Date: 2012-12-14 16:46:25 Computability theory Computational complexity theory Computational resources Models of computation Linear speedup theorem Universal Turing machine Speedup theorem DTIME Time complexity Theoretical computer science Applied mathematics Turing machine
843	Improving Exhaustive Search Implies Superpolynomial Lower Bounds Ryan Williams∗ IBM Almaden Research Center May 4, 2010 Add to Reading List Source URL: www.stanford.edu Language: English - Date: 2010-05-04 16:48:34 Complexity classes Computational resources Mathematical optimization Structural complexity theory Advice NTIME Probabilistically checkable proof NP P versus NP problem Theoretical computer science Computational complexity theory Applied mathematics
844	Multivariate Algorithmics for NP-Hard String Problems Laurent Bulteau∗ Falk Hüffner† Christian Komusiewicz Add to Reading List Source URL: fpt.akt.tu-berlin.de Language: English - Date: 2015-01-11 10:59:55 NP-complete problems Complexity classes Analysis of algorithms String Closest string Parameterized complexity Kernelization Time complexity Vertex cover Theoretical computer science Computational complexity theory Applied mathematics
845	Advanced Algorithms – COMS31900Lecture 19 Approximation Algorithms (part four) Asymptotic Polynomial Time Approximation Schemes Add to Reading List Source URL: www.cs.bris.ac.uk Language: English - Date: 2014-03-11 09:18:22 Complexity classes Approximation algorithms NP-complete problems Polynomial-time approximation scheme Time complexity NP PTAS L-reduction APX Theoretical computer science Computational complexity theory Applied mathematics
846	Defining lines of maximum probability for the design of patrol vessel itineraries Fernando Bação1 Victor Lobo2 1 ISEGI-UNL Add to Reading List Source URL: itcnt05.itc.nl Language: English - Date: 2008-09-22 04:53:24 NP-complete problems Operations research Neural networks Dimension reduction Travelling salesman problem Self-organizing map SOM NP Theoretical computer science Computational complexity theory Applied mathematics
847	Policy Sciences), © Elsevier Scientific Publishing Company, Amsterdam--Printed in Scotland Dilemmas in a General Theory of Planning* H O R S T W. J. R I T T E L Add to Reading List Source URL: jonathanstray.com Language: English - Date: 2012-03-19 14:37:31 Cognition Policy Problem solving Wicked problem Neuropsychological assessment Structural complexity theory Computational complexity theory Reduction Design Theoretical computer science Applied mathematics Mathematics
848	A Sublinear Time Algorithm for PageRank Computations Christian Borgs1 , Michael Brautbar2 , Jennifer Chayes1 , and Shang-Hua Teng3 1 Microsoft Research New England, One Memorial Drive, Cambridge, MA 02142 Add to Reading List Source URL: research.microsoft.com Language: English - Date: 2012-07-30 13:11:35 Link analysis Markov models Analysis of algorithms PageRank Reputation management Search engine optimization Randomized algorithm Time complexity Webgraph Theoretical computer science Computational complexity theory Mathematics
849	Fixed-parameter tractability of the Maximum Agreement Supertree problem Sylvain Guillemot, Vincent Berry ´ Equipe M´ Add to Reading List Source URL: www.cs.ucr.edu Language: English - Date: 2007-09-04 17:36:16 Phylogenetics Computational complexity theory Parameterized complexity Supertree
850	1. Statement of the big problem: Is there a clear statement of the big question? Is it a good big question? Identify the reasons why there is (or isn’t) confidence that the big question is tractable. You should think h Add to Reading List Source URL: earthweb.ess.washington.edu Language: English - Date: 2006-05-07 15:12:56 Knowledge Science studies Problem statement Falsifiability Scientific method Dynamic programming Computational complexity theory Science Problem solving Philosophy of science

UPDATE